Non-homeomorphic Disjoint Spaces whose Union is $\o^*$
نویسندگان
چکیده
منابع مشابه
Disjoint-union partial algebras
Disjoint union is a partial binary operation returning the union of two sets if they are disjoint and undefined otherwise. A disjoint-union partial algebra of sets is a collection of sets closed under disjoint unions, whenever they are defined. We provide a recursive first-order axiomatisation of the class of partial algebras isomorphic to a disjointunion partial algebra of sets but prove that ...
متن کاملTwo spaces homeomorphic to Seq ( p )
We consider the spaces called Seq(ut), constructed on the set Seq of all finite sequences of natural numbers using ultrafilters ut to define the topology. For such spaces, we discuss continuity, homogeneity, and rigidity. We prove that S(ut) is homogeneous if and only if all the ultrafilters ut have the same Rudin-Keisler type. We proved that a space of Louveau, and in certain cases, a space of...
متن کاملOn Isomorphic Groups and Homeomorphic Spaces
Let C(X, G) denote the group of continuous functions from a topological space X into a topological group G with the pointwise multiplication. Some classes of SQ-pairs and properties of the corresponding topological group C(X, G) with the compact-open topology are investigated. We also show that the existence of a group isomorphism between groups C(X, G) and C( Y, G) implies the existence of a h...
متن کاملNon-homeomorphic Conjugate Complex Varieties
We present a method to produce examples of non-homeomorphic conjugate complex varieties based on the genus theory of lattices. As an application, we give examples of arithmetic Zariski pairs.
متن کاملFinding dominators via disjoint set union
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-lineartime algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1993
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181072575